Clausal Intuitionistic Logic I - Fixed-Point Semantics
نویسنده
چکیده
D Since the advent of Horn-clause logic programming in the mid 1970’s, there have been numerous attempts to extend the expressive power of Horn-clause logic while preserving some of its attractive computational properties. This article, the first of a pair, presents a clausal language that extends Hornclause logic by adding negations and embedded implications to the righthand side of a rule, and interpreting these new rules intuitionistically, in a set of partial models. The resulting system is shown to have a fixed-point semantics that generalizes the van Emden-Kowalski semantics for Horn clauses. a
منابع مشابه
Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic
This paper introduces a non-clausal connection calculus for intuitionistic first-order logic. It is an extension of the non-clausal connection calculus for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic. nanoCoP-i is a first implementation of this intuitionistic non-clausal connection calculus. Details of the compact P...
متن کاملAutomated Reasoning in Quantified Non-Classical Logics
This paper introduces a non-clausal connection calculus for intuitionistic first-order logic. It is an extension of the non-clausal connection calculus for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic. nanoCoP-i is a first implementation of this intuitionistic non-clausal connection calculus. Details of the compact P...
متن کاملTruth-Maker Semantics for Intuitionistic Logic
I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relations...
متن کاملCombining Fixed-Point Definitions and Game Semantics in Logic Programming
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesti...
متن کاملClausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 5 شماره
صفحات -
تاریخ انتشار 1988